Canonical Vertex Partitions
نویسنده
چکیده
Let σ be a finite relational signature and T a set of finite complete relational structures of signature σ and HT the countable homogeneous relational structure of signature σ which does not embed any of the structures in T . In the case that σ consists of at most binary relations and T is finite the vertex partition behaviour of HT is completely analysed; in the sense that it is shown that a canonical partition exists and the size of this partition in terms of the structures in T is determined. If T is infinite some results are obtained but a complete analysis is still missing. Some general results are presented which are intended to be used in further investigations in case that σ contains relational symbols of arity larger than two or that the set of bounds T is infinite.
منابع مشابه
k-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملBijections on two variations of noncrossing partitions
A (set) partition of [n] = {1, 2, . . . , n} is a collection of mutually disjoint nonempty subsets, called blocks, of [n] whose union is [n]. We will write a partition as a sequence of blocks (B1, B2, . . . , Bk) such that min(B1) < min(B2) < · · · < min(Bk). There are two natural representations of a partition. Let π = (B1, B2, . . . , Bk) be a partition of [n]. The partition diagram of π is t...
متن کاملVertex Operators and Moduli Spaces of Sheaves
The Nekrasov partition function in supersymmetric quantum gauge theory is mathematically formulated as an equivariant integral over certain moduli spaces of sheaves on a complex surface. In SeibergWitten Theory and Random Partitions, Nekrasov and Okounkov studied these integrals using the representation theory of “vertex operators” and the infinite wedge representation. Many of these operators ...
متن کاملValence-partitioned genus polynomials and their application to generalized dipoles
Calculations of genus polynomials are given for three kinds of dipoles: with no loops; with a loop at one vertex; or with a loop at both vertices. We include a very concise, elementary derivation of the genus polynomial of a loopless dipole. To describe the general effect on the face-count and genus polynomials of the operation of adding a loop at a vertex, we introduce imbedding types that are...
متن کاملBrick partitions of graphs
For each rational number q ≥ 1, we describe two partitions of the vertex set of a graph G, called the q-brick partition and the q-superbrick partition. The special cases when q = 1 are the partitions given by the connected components and the 2-edge-connected components of G, respectively. We obtain structural results on these partitions and describe their relationship to the principal partition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 12 شماره
صفحات -
تاریخ انتشار 2003